A Memory Efficient Self-stabilizing Algorithm for Maximal k -Packing
نویسندگان
چکیده
The k-packing problem asks for a subset S of the nodes in a graph such that the distance between any pair of nodes in S is greater than k. This problem has applications to placing facilities in a network. In the current paper we present a self-stabilizing algorithm for computing a maximal k-packing in a general graph. Our algorithm uses a constant number of variables per node. This improves the memory requirement compared to the previous most memory efficient algorithm [9] which used k variables per node. In addition the presented algorithm is very short and simple.
منابع مشابه
Self-Stabilizing Algorithms for Maximal 2-packing and General k-packing (k ≥ 2) with Safe Convergence in an Arbitrary Graph
In a graph or a network G = (V,E), a set S ⊆ V is a 2-packing if ∀i ∈ V : |N [i] ∩ S| ≤ 1, where N [i] denotes the closed neighborhood of node i. A 2-packing is maximal if no proper superset of S is a 2-packing. This paper presents a safely converging self-stabilizing algorithm for maximal 2-packing problem. Under a synchronous daemon, it quickly converges to a 2packing (a safe state, not neces...
متن کاملA New Self-stabilizing Algorithm for Maximal 2-packing
In the self-stabilizing algorithmic paradigm, each node has a local view of the system, in a finite amount of time the system converges to a global state with desired property. In a graph , a subset is a -packing if . In this paper, an ID-based, constant space, self-stabilizing algorithm that stabilizes to a maximal -packing in an arbitrary graph is proposed. It is shown that the algorithm stab...
متن کاملLow Power March Memory Test Algorithm for Static Random Access Memories (TECHNICAL NOTE)
Memories are most important building blocks in many digital systems. As the Integrated Circuits requirements are growing, the test circuitry must grow as well. There is a need for more efficient test techniques with low power and high speed. Many Memory Built in Self-Test techniques have been proposed to test memories. Compared with combinational and sequential circuits memory testing utilizes ...
متن کاملA Self-stabilizing Algorithm for Maximal 2-packing
In the self-stabilizing algorithmic paradigm for distributed computing each node has only a local view of the system, yet in a finite amount of time the system converges to a global state, satisfying some desired property. In a graph G = (V, E), a subset S ⊆ V is a 2-packing if ∀u ∈ V : |N [u] ∩ S| ≤ 1. In this paper we present an ID-based, selfstabilizing algorithm for finding a maximal 2-pack...
متن کاملMemory efficient Self - Stabilizing k - Independent Dominating
We propose a memory efficient self-stabilizing protocol building k-independent dominating sets. A k-independent dominating set is a k-independent set and a kdominating set. A set of nodes, I, is k-independent if the distance between any pair of nodes in I is at least k + 1. A set of nodes, D, is a k-dominating if every node is within distance k of a node of D. Our algorithm, named SID, is silen...
متن کامل